Streaming Capacity in P2P Live Systems

Peer-to-Peer (P2P) Live streaming has become a popular service in the Internet. Recently, what is the upper bound of the streaming rate in a P2P live system becomes an attractive topic. In this report, we investigate the streaming capacity problem in both tree-based and mesh-based P2P live systems. In tree-based P2P live systems, the formulation of the streaming capacity problem has been reported in [3], we provide an alternative solution, a proximal decomposition algorithm, to this formulation. In meshbased P2P live systems, we maximize the streaming rate via optimal link rate allocation, we propose a proximal decomposition algorithm to solve the optimization problem. The decentralized nature of the proposed algorithm matches well with the distributed P2P networks.